Operations on logic functions and variables through sign Haar spectra
نویسندگان
چکیده
A non-linear transform, called ‘‘sign Haar transform’’ has recently been introduced. The transform is unique and converts binary/ternary vectors into ternary spectral domain. Recursive definitions for the calculation of sign Haar transform are developed. Essential properties of logic functions and variables in the spectral domain of a quantized transform based on Haar functions are presented. Sign Haar transform has the smallest computational cost of all the quantized transforms. The properties of logic functions are listed for two different codings of incompletely specified functions. 2002 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Properties of Logic Functions in Spectral Domain of Sign Hadamard-Haar Transform
A non-linear transform, called ‘Sign Hadamard-Haar transform’ is introduced. The transform is unique and converts ternary vectors into ternary spectral domain. Recursive definition and fast transform have been developed. Formulae to represent Sign Hadamard-Haar spectra for basic logic functions and their variables for two different codings are shown. New transform is extremely effective in term...
متن کاملApplication of modified sign Haar transform in logic functions
Modified sign Haar transform with sign Walsh-like structure is introduced in this article. This nonlinear transform converts binary/ternary vectors into digital spectral domain and is invertible. Recursive definitions for the calculation of this transform have been developed. The properties of logic functions and variables in the spectral domain of the modified sign Haar transform are presented.
متن کاملGeneralized Haar Spectral Representations and Their Applications
Haar transform is known to have the smallest computational requirement and has been used mainly for pattern recognition and image processing. Although the properties of Haar spectra of Boolean functions have considerable interest and attraction, the majority of publications to date have employed the Walsh rather than Haar transform in their considerations. It is mainly due to the fact that up t...
متن کاملForward and Inverse Transformations Between Haar Spectra and Ordered Binary Decision Diagrams of Boolean Functions
Unnormalized Haar spectra and Ordered Binary Decision Diagrams (OBDDs) are two standard representations of Boolean functions used in logic design. In this article, mutual relationships between those two representations have been derived. The method of calculating the Haar spectrum from OBDD has been presented. The decomposition of the Haar spectrum, in terms of the cofactors of Boolean function...
متن کاملMinimization of Circuit Design Using Permutation of Haar Wavelet Series
There is an apparent renewed interest in application of the Haar wavelet transform in switching theory and logic design.1–6 In particular, the discrete Haar transform appears very interesting for its wavelets-like properties and fast calculation algorithms. The applications have been found in circuit synthesis, verification and testing.1–9 For applications of the Haar transform in logic design,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Electrical Engineering
دوره 29 شماره
صفحات -
تاریخ انتشار 2003